Minimal embedding dimensions of connected neural codes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization and Minimal Embeddings of Connected Neural Codes

We give a complete characterization of receptive field codes realizable by connected receptive fields and their minimal embedding dimensions. In particular, we show that all connected codes are realizable in dimension at most three. To our knowledge, this is the first family of receptive field codes for which the exact characterization and minimal embedding dimension is known.

متن کامل

Connected partition dimensions of graphs

For a vertex v of a connected graph G and a subset S of V (G), the distance between v and S is d(v, S) = min{d(v, x)|x ∈ S}. For an ordered k-partition Π = {S1, S2, · · · , Sk} of V (G), the representation of v with respect to Π is the k-vector r(v|Π) = (d(v, S1), d(v, S2), · · · , d(v, Sk)). The k-partition Π is a resolving partition if the k-vectors r(v|Π), v ∈ V (G), are distinct. The minimu...

متن کامل

On the Minimal Embedding Field

We discuss the underlying mathematics that causes the embedding degree of a curve of any genus to not necessarily correspond to the minimal embedding field, and hence why it may fail to capture the security of a pairing-based cryptosystem. Let C be a curve of genus g defined over a finite field Fq, where q = p for a prime p. The Jacobian of the curve is an abelian variety, JC(Fq), of dimension ...

متن کامل

Minimal Universal Extra Dimensions

Highly degenerate spectra associated with universal extra dimensions (UED) provide an interesting phenomenology not only from the point of view of cosmology and astrophysics, but also for colliders. We study these exotic signals for the simplest case, called minimal UED, where it is natural to find slow charged particles, displaced vertices, tracks with non-vanishing impact parameters, track ki...

متن کامل

On Minimal and Almost-Minimal Linear Codes

Minimal linear codes are such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing and secure two-party computations. We pursue here the study of minimal codes and construct infinite families with asymptotically non-zero rates. We also introduce a relaxation to almost minima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebraic Statistics

سال: 2020

ISSN: 2693-3004,2693-2997

DOI: 10.2140/astat.2020.11.99